An algorithm for source location in directed graphs
نویسندگان
چکیده
منابع مشابه
An algorithm for source location in directed graphs
Ito, Makino, Arata, Honami, Itatsu, and Fujishige [6] provided a theoretical answer to a source location problem by proving that the minimum cardinality of a subset R of nodes in an edge-capacitated directed graph D = (V,A) so that the maximum flow-amount from R to every node v ∈ V − R is at least k and the maximum flow amount from every node v ∈ V − R to R is at least l is equal to the maximum...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملAn Algorithm for Finding Hamilton Cycles in Random Directed Graphs
We describe a polynomial (O( n’.‘)) time algorithm DHAM for finding hamilton cycles in digraphs. For digraphs chosen uniformly at random from the set of digraphs with vertex set (1,2,. . . , n } and m = m(n) edges the limiting probability (as n + co) that DHAM finds a hamilton cycle equals the limiting probability that the digraph is hamiltonian. Some applications to random “ travelling salesma...
متن کاملSource location in undirected and directed hypergraphs
In this paper we generalize source location problems with edge-connectivity requirements on undirected and directed graphs to similar problems on undirected and directed hypergraphs. In the undirected case we consider an abstract framework which contains the source location for undirected hypergraphs as a special case and which can be solved in polynomial time. For the directed case, the asymme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2005
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.07.005